On asymptotic Lagrangian duality for nonsmooth optimization
نویسندگان
چکیده
منابع مشابه
Interior Epigraph Directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
We propose and study a new method, called the Interior Epigraph Directions (IED) method, for solving constrained nonsmooth and nonconvex optimization. The IED method considers the dual problem induced by a generalized augmented Lagrangian duality scheme, and obtains the primal solution by generating a sequence of iterates in the interior of the dual epigraph. First, a deflected subgradient (DSG...
متن کاملConvex Optimization and Lagrangian Duality
Finally the Lagranage dual function is given by g(~λ, ~ν) = inf~x L(~x,~λ, ~ν) We now make a couple of simple observations. Observation. When L(·, ~λ, ~ν) is unbounded from below then the dual takes the value −∞. Observation. g(~λ, ~ν) is concave1 as it is the infimum of a set of affine2 functions. If x is feasible solution of program (10.2)(10.4), then we have the following L(x,~λ, ~ν) = f0(x)...
متن کاملDuality without constraint qualification in nonsmooth optimization
We are concerned with a nonsmooth multiobjective optimization problem with inequality constraints. In order to obtain our main results, we give the definitions of the generalized convex functions based on the generalized directional derivative. Under the above generalized convexity assumptions, sufficient and necessary conditions for optimality are given without the need of a constraint qualifi...
متن کاملBenson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality
In this paper, we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints. We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions. We also fo...
متن کاملSmoothing augmented Lagrangian method for nonsmooth constrained optimization problems
In this paper, we propose a smoothing augmented Lagrangian method for finding a stationary point of a nonsmooth and nonconvex optimization problem. We show that any accumulation point of the iteration sequence generated by the algorithm is a stationary point provided that the penalty parameters are bounded. Furthermore, we show that a weak version of the generalized Mangasarian Fromovitz constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ANZIAM Journal
سال: 2017
ISSN: 1445-8810
DOI: 10.21914/anziamj.v58i0.11874